Convergence of a generalized penalty and regularization method for quasi–variational–hemivariational inequalities

نویسندگان

چکیده

In the paper an elliptic quasi–variational–hemivariational inequality with constraints in a Banach space is studied. First, we apply Minty technique, KKM principle and theory of nonsmooth analysis to establish solvability problem. Then, employ generalized penalty regularization method for introduce family penalized regularized problems no Gâteaux differentiable potentials. Through limit procedure, prove that Kuratowski upper respect weak topology solution sets problems, nonempty subset set original Next, if set-valued operator has (S)+-property, then limits strong topologies coincide. Finally, illustrate our results by examining nonlinear inclusion subgradient term locally Lipschitz function, mixed boundary conditions obstacle unilateral constraint which appears semipermeability

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Penalty Method for a New System of Generalized Variational Inequalities

the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We consider a new system of generalized variational inequalities SGVI. Using the penalty methods, we prove the existence of solution of SGVI in Hilbert spaces. Our results extend and improve some known results.

متن کامل

Convergence of online gradient method for feedforward neural networks with smoothing L1/2 regularization penalty

Minimization of the training regularization term has been recognized as an important objective for sparse modeling and generalization in feedforward neural networks. Most of the studies so far have been focused on the popular L2 regularization penalty. In this paper, we consider the convergence of online gradient method with smoothing L1/2 regularization term. For normal L1/2 regularization, th...

متن کامل

Optimal Penalty-feti Method for Variational Inequalities

We shall first briefly review our results related to solving of the convex box constrained quadratic programming problems by combination of the active set strategy and the conjugate gradient method with projections [1]. In particular, we shall show that with proper modification of the proportioning algorithm with projection [2], it is possible give the rate of convergence in terms of the spectr...

متن کامل

A penalty method and a regularization strategy to solve MPCC

The goal of this paper is to solve Mathematical Program with Complementarity Constraints (MPCC) using nonlinear programming (NLP) techniques. This work presents two algorithms based on several nonlinear techniques such as Sequential Quadratic Programming (SQP), penalty techniques and regularization schemes. A set of AMPL problems were tested and the computational experience shows that both algo...

متن کامل

Adaptive multi-penalty regularization based on a generalized Lasso path

For many algorithms, parameter tuning remains a challenging and critical task, which becomes tedious and infeasible in a multi-parameter setting. Multi-penalty regularization, successfully used for solving undetermined sparse regression of problems of unmixing type where signal and noise are additively mixed, is one of such examples. In this paper, we propose a novel algorithmic framework for a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Nonlinear Science and Numerical Simulation

سال: 2021

ISSN: ['1878-7274', '1007-5704']

DOI: https://doi.org/10.1016/j.cnsns.2021.105998